منابع مشابه
Finding Smallest Supertrees Under Minor Containment
The diversity of application areas relying on tree structured data results in a wide interest in algorithms which determine di erences or similarities among trees One way of measuring the similarity between trees is to nd the smallest common superstructure or supertree where common elements are typically de ned in terms of a mapping or embedding In the simplest case a supertree will contain exa...
متن کاملHuxley versus Owen: the hippocampus minor and evolution.
In Victorian Britain a major debate over evolution raged between Thomas H. Huxley and Richard Owen. The central issue between them was whether or not the human brain was unique in having a hippocampus minor (also known as the calcar avis), a posterior horn and a posterior lobe.
متن کاملFinding Minor - Order Obstruction Sets : Feedback Vertex Set 2
We describe an application of an obstruction set computation platform that identiies the previously unknown obstruction sets for the k-Feedback Vertex Set problem, for k = 1 and k = 2. Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem (GMT). It has been known for several years that, in principle, obstruction sets can be mechanically c...
متن کاملHippocampus minor and man's place in nature: a case study in the social construction of neuroanatomy.
In mid-19th century Britain the possibility of evolution and particularly the evolution of man from apes was vigorously contested. Among the leading antievolutionists was the celebrated anatomist and paleontologist Richard Owen and among the leading defenders of evolution was Thomas Henry Huxley. The central dispute between them on human evolution was whether or not man's brain was fundamentall...
متن کاملTuring Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
The notion of Turing kernelization investigates whether a polynomial-time algorithm can solve an NP-hard problem, when it is aided by an oracle that can be queried for the answers to bounded-size subproblems. One of the main open problems in this direction is whether k-Path admits a polynomial Turing kernel: can a polynomial-time algorithm determine whether an undirected graph has a simple path...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Anthropology: Issues, News, and Reviews
سال: 2007
ISSN: 1060-1538
DOI: 10.1002/evan.20131